Joint Chance-Constrained Reliability Optimization with General Form of Distributions
نویسندگان
چکیده
منابع مشابه
An Alternating Direction Method for Chance-Constrained Optimization Problems with Discrete Distributions
Chance-Constrained Optimization Problems with Discrete Distributions Xiaodi Bai Department of Management Science, School of Management, Fudan University, Shanghai 200433, P. R. China, [email protected] Jie Sun Department of Decision Sciences and Risk Management Institute, National University of Singapore, Singapore 119245, [email protected] Xiaoling Sun Department of Management Science, School o...
متن کاملJoint rectangular geometric chance constrained programs
This paper discusses joint rectangular geometric chance constrained programs. When the stochastic parameters are elliptically distributed and pairwise independent, we present a reformulation of the joint rectangular geometric chance constrained programs. As the reformulation is not convex, we propose new convex approximations based on variable transformation together with piecewise linear appro...
متن کاملOn distributionally robust joint chance-constrained problems
Introduction: A chance constrained optimization problem involves constraints with stochastic data that are required to be satisfied with a pre-specified probability. When the underlying distribution of the stochastic data is not known precisely, an often used model is to require the chance constraints to hold for all distributions in a given family. Such a problem is known as a distributionally...
متن کاملGlobal optimization of robust chance constrained problems
We propose a stochastic algorithm for the global optimization of chance constrained problems. We assume that the probability measure with which the constraints are evaluated is known only through its moments. The algorithm proceeds in two phases. In the first phase the probability distribution is (coarsely) discretized and solved to global optimality using a stochastic algorithm. We only assume...
متن کاملConvex relaxations of chance constrained optimization problems
In this paper we develop convex relaxations of chance constrained optimization problems in order to obtain lower bounds on the optimal value. Unlike existing statistical lower bounding techniques, our approach is designed to provide deterministic lower bounds. We show that a version of the proposed scheme leads to a tractable convex relaxation when the chance constraint function is affine with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Operations Research
سال: 2016
ISSN: 1813-713X,1813-7148
DOI: 10.21307/ijor-2015-007